Error Free Butcher Algorithms for Linear Electrical Circuits
نویسندگان
چکیده
منابع مشابه
Singular fractional linear systems and electrical circuits
A new class of singular fractional linear systems and electrical circuits is introduced. Using the Caputo definition of the fractional derivative, the Weierstrass regular pencil decomposition and the Laplace transformation, the solution to the state equation of singular fractional linear systems is derived. It is shown that every electrical circuit is a singular fractional system if it contains...
متن کاملZero Dynamics and Funnel Control for Linear Electrical Circuits
We consider electrical circuits containing linear resistances, capacitances, inductances. The circuits can be described by differential-algebraic input-output systems, where the input consists of voltages of voltage sources and currents of current sources and the output consists of currents of voltage sources and voltages of current sources. We generalize a characterization of asymptotic stabil...
متن کاملScale-Free Algorithms for Online Linear Optimization
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We achieve adaptiveness to norms of loss vectors by scale invariance, i.e., our algorithms make exactly the same decisions if the sequence of loss vectors is multiplied by any positive constant. Our algorithms work for a...
متن کاملRoundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملCorrelation Bounds and #SAT Algorithms for Small Linear-Size Circuits
We revisit the gate elimination method, generalize it to prove correlation bounds of boolean circuits with Parity, and also derive deterministic #SAT algorithms for small linear-size circuits. In particular, we prove that, for boolean circuits of size 3n − n, the correlation with Parity is at most 2−n Ω(1) , and there is a #SAT algorithm running in time 2n−n Ω(1) ; for circuit size 2.99n, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2005
ISSN: 1225-6463
DOI: 10.4218/etrij.05.0104.0055